import java.util.Scanner;

public class Practice1 {
    //https://www.nowcoder.com/practice/886370fe658f41b498d40fb34ae76ff9?tpId=295&tqId=1377477&ru=/exam/company&qru=/ta/format-top101/question-ranking&sourceUrl=%2Fexam%2Fcompany@
    //简单的链表回顾了



    /*
     * public class ListNode {
     *   int val;
     *   ListNode next = null;
     *   public ListNode(int val) {
     *     this.val = val;
     *   }
     * }
     */

        /**
         * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
         *
         *
         * @param pHead ListNode类
         * @param k int整型
         * @return ListNode类
         */
        public static ListNode FindKthToTail (ListNode pHead, int k) {
            // write code here
            ListNode ret = pHead;
            ListNode cur = pHead;
            while(cur != null &&k-- > 0 ){
                cur = cur.next;
            }
            if(k > 0){
                return null;
            }
            while(cur != null){
                ret = ret.next;
                cur = cur.next;
            }

            return ret;
        }
    public static void main(String[] args) {

    }
}
